Parallel Algorithms for the Third Extension of the Sieve of Eratosthenes
نویسندگان
چکیده
A prime number sieve is an algorithm for finding all prime numbers in the range [2,n]. For large n, however, the actual run time of existing algorithms on a single processor computer is prohibitive. Fortunately, the classic Sieve of Eratosthenes and its extensions are suitable for massively parallel architectures or networks of workstations. Two mappings of the third extension sieve are presented. One is for a massively parallel SIMD architecture and the other is for a network of workstations using the PVM message-passing library.
منابع مشابه
Block Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملCache optimized linear sieve
Sieving is essential in different number theoretical algorithms. Sieving with large primes violates locality of memory access, thus degrading performance. Our suggestion on how to tackle this problem is to use cyclic data structures in combination with in-place bucket-sort. We present our results on the implementation of the sieve of Eratosthenes, using these ideas, which show that this approac...
متن کاملA Fully Distributed Prime Numbers Generation using the Wheel Sieve
This article presents a new distributed approach for generating all prime numbers up to a given limit. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the advances of the parallel computers (which have permitted to reach large limits or to obtain the previous results in a shorter time), prime numbers generation still represents an attractive domain of rese...
متن کاملA Survey of Results on Primes in Short Intervals
Prime numbers have been a source of fascination for mathematicians since antiquity. The proof that there are infinitely many prime numbers is attributed to Euclid (fourth century B.C.). The basic method of determining all primes less than a given number N is the sieve of Eratosthenes (third century B.C.). Diophantus (third (?) century A.D.) was occupied with finding rational number solutions to...
متن کاملThe Genuine Sieve of Eratosthenes
A much beloved and widely used example showing the elegance and simplicity of lazy functional programming represents itself as “The Sieve of Eratosthenes”. This paper shows that this example is not the sieve, and presents an implementation that actually is.
متن کامل